Design of Space-Curve Meshing-Wheels with Unequal Tine Radii
نویسندگان
چکیده
منابع مشابه
On (k, l)-radii of wheels
To determine the (k, l)-radius of a graph we have to find a set L of l vertices, such that the maximum k-distance of a set K, where |K| = k and L ⊆ K, attains the minimum value in a graph. This notion generalizes the radius, diameter and k-diameter. In this contribution the (k, l)-radius of the wheel Wn is determined for all possible values of parameters k and l.
متن کاملDesign of Filters for Discrete Short-tine Fourier Transform Synthesis
In this paper we present a nethod f or computing the synthesis filter (window) needed in a weighted overlap—add (WOLA) scheme for the reconstruction of signals in analysis/synthesis systems used to implement the discrete short time Fourier transform (DSTFT). The method is based on an algebraic representation of the analysis synthesis process and assume that the analysis filter (window) is known...
متن کاملDesign and Analysis of Modular Mobile Robot with Magnetic Wheels
In the paper, a modular climbing-wall mobile robot with four magnetic wheels is presented. It can move on the vertical steel wall and inspect the weld seam. First, the structure of the mobile robot is analyzed. It is modular, which consists of a light manipulator module, an ultrasonic probes module and a weld testing sensors module. Then, the magnetic wheels are designed and analysed. One magne...
متن کاملCurve linearization and discretization for meshing composite parametric surfaces
In the context of composite parametric surface meshing using a direct or an indirect (via the meshing of parametric domains) method, the discretization of interface curves joining patches plays a central part. In the case of an indirect method, the discretization of interface curves must be taken back to parametric spaces. This is usually done using root nding techniques for generally non-linea...
متن کاملOnion Curve: A Space Filling Curve with Near-Optimal Clustering
Space filling curves (SFCs) are widely used in the design of indexes for spatial and temporal data. Clustering is a key metric for an SFC, that measures how well the curve preserves locality in moving from higher dimensions to a single dimension. We present the onion curve, an SFC whose clustering performance is provably close to optimal for cube and nearcube shaped query sets, irrespective of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Strojniški vestnik – Journal of Mechanical Engineering
سال: 2012
ISSN: 0039-2480
DOI: 10.5545/sv-jme.2012.493